On Algorithms for the k-Error Linear Complexity of Sequences over GF (p) with Period p
نویسنده
چکیده
منابع مشابه
An Algorithm for Computing m-Tight Error Linear Complexity of Sequences over GF (p) with Period p
The linear complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. Based on the theories of linear complexity, k-error linear complexity, the minimum error and the k-error linear complexity profile, the notion of m-tight error linear complexity is presented. An efficient algorithm for computing m-tight error linear complexity is derived from the algo...
متن کاملAn Algorithm for Computing m-Tight Error Linear Complexity of Sequences over GF(p^m) with Period p^m
The linear complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. Based on the theories of linear complexity, k-error linear complexity, the minimum error and the k-error linear complexity profile, the notion of m-tight error linear complexity is presented. An efficient algorithm for computing m-tight error linear complexity is derived from the algo...
متن کاملFast Algorithms for Determining the Linear Complexity of Period Sequences
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pq over GF(q), the other is the algorithm fo...
متن کاملFast Algorithms for Determining the Minimal Polynomials of Sequences with Period kn Over GF(Pm)
A fast algorithm is derived for determining the linear complexity and the minimal polynomials of sequences over GF (p) with period kn, where p is a prime number, gcd(n, p − 1) = 1 and p − 1 = ku, n, k and u are integers. The algorithm presented here covers the algorithm proposed by Chen for determining the minimal polynomials of sequences over GF (p) with period 2n, where p is a prime, gcd(n, p...
متن کاملFast algorithms for determining the linear complexities of sequences over GF (p) with the period 3n
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF (p)(any positive integer m) with the period 3n (n and p−1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999